Stochastic Coalgebraic Logic - Preamble
نویسنده
چکیده
Preface Motivation Modal logics are usually interpreted through Kripke models, branching logics find their interpretation through models which deal with infinite paths. These seemingly structurally different interpretations can be unified by considering coalgebras which model the underlying worlds suitably; the predicates through which the formulas are represented in their interpretation are modelled using natural transformations between functors, to which the functor that underlies the coalgebra contributes. The basic functor is usually based on the power set functor. Adopting this general approach, we see that a fairly general and uniform way of interpreting modal logics and their step twins arises through coalgebras and the generalization of predicates into suitable natural transformations. We will show in this treatise that coalgebras based on the subprobability functor are amenable to these ideas as well. Having arrived at this general approach of interpreting a rather broad family of logics, the question of comparing different models relative to a given logic presents itself. So we ask (and answer) the question about the conditions under which the well investigated relationship of logical equivalence, bisimilarity, and behavioral equivalence holds in this generalized, uniform scenario. This is one of two driving topics in this book. The other one notes that stochastic interpretations — such as the ones indicated above — rest on stochastic relations, which in turn are the Kleisli morphisms for the Giry monad. The morphisms considered so far are based on measurable maps which are the morphisms of the base category. But at least bisimilarity and behavioral equivalence are formulated through morphisms, viz., through the existence of a span or a cospan, respectively. These formulations apply verbatim to Kleisli morphisms as well. Generalizing logical equivalence to distribu-tional equivalence lifts the entire stage to the level of the Kleisli category, and, again, the problem of the relationship of the various behavioral descriptions vii viii Preface presents itself. Since morphisms and congruences are very closely related, a study of these issues needs to be accompanied by a careful investigation of congruences on the Kleisli category. A brief survey of the contents of the individual chapters is in order. Stochastic relations form the mathematical basis for a probabilistic interpretation of coalgebraic logics. They provide also a foundation for Markov transition systems. These relations in turn are based on transition probabilities, and because we do not confine ourselves to the probabilistic case but rather accept models in which mass vanishes, we …
منابع مشابه
Exploiting Parallelism in Coalgebraic Logic Programming
We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of logic programming, with coalgebraic derivation algorithm featuring both corecursion and parallelism. Here, we discuss how the coalgebraic semantics influenced our parallel implementation of logic programming.
متن کاملCoalgebraic Modal Logic in CoCasl
We extend the algebraic-coalgebraic specification language CoCasl by full coalgebraic modal logic based on predicate liftings for functors. This logic is more general than the modal logic previously used in CoCasl and supports the specification of a variety of modal logics, such as graded modal logic, majority logic, and probabilistic modal logic. CoCasl thus becomes a modern modal language tha...
متن کاملMaximal traces and path-based coalgebraic temporal logics
This paper gives a general coalgebraic account of temporal logics whose semantics involves a notion of computation path. Examples of such logics include the logic CTL* for transition systems and the logic PCTL for probabilistic transition systems. Our path-based temporal logics are interpreted over coalgebras of endofunctors obtained as the composition of a computation type (e.g. nondeterminist...
متن کاملCoalgebraic Correspondence Theory
We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In particular, we prove a coalgebraic version of the van Benthem/Rosen theorem stating that both over arbitrary structures and over finite structures, coalgebraic modal logic is precisely the bisimulation invariant fragment of first-orde...
متن کاملA Finite Model Construction for Coalgebraic Modal Logic
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015